Packings of circles and spheres Lectures III and IV Session on Granular Matter Institut Henri Poincaré R. Connelly Cornell University

Source URL: www.math.cornell.edu

• Crystallography
• Spheres
• Random close pack
• Close-packing of equal spheres
• Containerization
• Sphere packing
• Packing problem
• Geometry
• Discrete geometry
• Mathematics

Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with

Source URL: www.cs.bris.ac.uk

• Complexity classes
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Discrete geometry
• Packing problem
• Polynomial-time approximation scheme
• Time complexity
• Bin
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if,

Source URL: www.cs.bris.ac.uk

• Complexity classes
• Bin packing problem
• Approximation algorithm
• Polynomial-time approximation scheme
• Subset sum problem
• NP
• PP
• Time complexity
• P
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if,

Source URL: www.cs.bris.ac.uk

• NP-complete problems
• Operations research
• Bin packing problem
• Approximation algorithm
• Job shop scheduling
• Greedy algorithm
• Algorithm
• Theoretical computer science
• Mathematics
• Applied mathematics

Data Locality Problems and Colored Bin Packing Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil) May 11, 2009 Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil)

Source URL: www.cs.bris.ac.uk

• Operations research
• Job shop scheduling
• Campinas
• Approximation algorithm
• Bin
• Theoretical computer science
• Applied mathematics
• Bin packing problem

Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes

Source URL: www.cs.bris.ac.uk

• NP-complete problems
• Dynamic programming
• Subset sum problem
• Bin packing problem
• Approximation algorithm
• Complexity classes
• Combinatorial optimization
• NP
• Partition problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

NP-completeness recap Advanced Algorithms – COMS31900 • NP is the class of problems we can

Source URL: www.cs.bris.ac.uk

Other Problems of the First Ten Years: The Railroad Flatcar Problem Two railroad flatcars are to be loaded with seven types of packing crates.

Source URL: www.comap.com

• Dog crate
• Transport
• Flatcar
• Technology
• Containers
• Shipping containers
• Crate

How many plates? Don L. Anderson* California Institute of Technology, Seismological Laboratory, 1200 East California Boulevard, M/C, Pasadena, California 91125, USA ABSTRACT

Source URL: www.mantleplumes.org

• Triple junction
• Mantle convection
• Plate reconstruction
• Tessellation
• Packing problem
• Transform fault
• Circle packing
• Geology
• Plate tectonics
• Historical geology

Optimizing Web Traffic via the Media Scheduling Problem Lars Backstrom∗ Jon Kleinberg† Ravi Kumar

Source URL: www.cs.cornell.edu

• Applied mathematics
• Bin packing problem
• Dynamic programming
• Function
• Big O notation
• Clickthrough rate
• Scheduling
• Mathematical optimization
• Mathematics
• Operations research
• Mathematical analysis